| 翻訳と辞書 |
| asymptotic decider ： ウィキペディア英語版 |
asymptotic decider
In scientific visualization the asymptotic decider is an algorithm developed by Nielson and Hamann in 1991 that creates isosurfaces from a given scalar field. It was proposed as an improvement to the marching cubes algorithm, which can produce some "bad" topology, but can also be considered an algorithm in its own right.
== Principle ==
The algorithm first divides the scalar field into uniform cubes. It draws topologically correct contours on the sides (interface) of the cubes. These contours can then be connected to polygons and triangulated. The triangles of all cubes form the isosurfaces and are thus the output of the algorithm. Sometimes there is more than one way to connect adjacent constructs. This algorithm describes a method for resolving these ambiguous configurations in a consistent manner.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「asymptotic decider」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|